Classification of Boolean Functions Where Affine Functions Are Uniformly Distributed
نویسندگان
چکیده
منابع مشابه
Classification of Boolean Functions where Affine Functions are Uniformly Distributed
Classification of Non-linear Boolean functions is a long-standing problem in the area of theoreticalcomputer science. In this paper, effort has been made to achieve a systematic classification of all n-variableBoolean functions, where only one affine Boolean function belongs to each class. Two different methods areproposed to achieve this classification. The first method is a recurs...
متن کاملAffine equivalence of cubic homogeneous rotation symmetric Boolean functions
Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The simplest case of quadratic rotation symmetric functions which are generated by cyclic permutations of the variables in a single monomial was only settled in 200...
متن کاملThe Norm Estimates of Pre-Schwarzian Derivatives of Spirallike Functions and Uniformly Convex $alpha$-spirallike Functions
For a constant $alphain left(-frac{pi}{2},frac{pi}{2}right)$, we definea subclass of the spirallike functions, $SP_{p}(alpha)$, the setof all functions $fin mathcal{A}$[releft{e^{-ialpha}frac{zf'(z)}{f(z)}right}geqleft|frac{zf'(z)}{f(z)}-1right|.]In the present paper, we shall give the estimate of the norm of the pre-Schwarzian derivative $mathrm{T}...
متن کاملPartitioning 1-variable Boolean functions for various classification of n-variable Boolean functions
Partitioning 1-variable Boolean functions for various classification of nvariable Boolean functions Ranjeet Kumar Rout, Pabitra Pal Choudhury, Sudhakar Sahoo & Camellia Ray a Applied Statistics Unit, Indian Statistical Institute, Kolkata-700108, India; b Institute of Mathematics and Applications, Bhubaneswar-751003, India Accepted author version posted online: 14 Oct 2014.Published online: 14 N...
متن کاملMonotone Boolean Functions Are Universal Approximators
The employment of proper codings, such as the base-2 coding, has allowed to establish the universal approximation property of Boolean functions: if a sufficient number b of inputs (bits) is taken, they are able to approximate arbitrarily well any real Borel measurable mapping. However, if the reduced set of monotone Boolean functions, whose expression involves only and and or operators, is cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Mathematics
سال: 2013
ISSN: 2090-9837,2090-9845
DOI: 10.1155/2013/270424